Computing #2-SAT of Grids, Grid-Cylinders and Grid-Tori Boolean Formulas
نویسندگان
چکیده
We present an adaptation of transfer matrix method for signed grids, grid-cylinders and grid-tori. We use this adaptation to count the number of satisfying assignments of Boolean Formulas in 2-CNF whose corresponding associated graph has such grid topologies.
منابع مشابه
Improving Mobile Grid Performance Using Fuzzy Job Replica Count Determiner
Grid computing is a term referring to the combination of computer resources from multiple administrative domains to reach a common computational platform. Mobile Computing is a Generic word that introduces using of movable, handheld devices with wireless communication, for processing data. Mobile Computing focused on providing access to data, information, services and communications anywhere an...
متن کاملImproving Mobile Grid Performance Using Fuzzy Job Replica Count Determiner
Grid computing is a term referring to the combination of computer resources from multiple administrative domains to reach a common computational platform. Mobile Computing is a Generic word that introduces using of movable, handheld devices with wireless communication, for processing data. Mobile Computing focused on providing access to data, information, services and communications anywhere an...
متن کاملIncorporating Clause Learning in Grid-Based Randomized SAT Solving
Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating clause learning, known to yield significant speed-ups in the sequential case, in such a distributed framework. The approach exploits existing state-of-the-art clause learning SAT solvers by embedding them with virtually no modifications. Th...
متن کاملA Distribution Method for Solving SAT in Grids
The emerging large-scale computational grid infrastructure is providing an interesting platform for massive distributed computations. In this paper the problem of exploiting such computational grids for solving challenging propositional satisfiability problem (SAT) instances is studied. When designing a distributed algorithm for a large loosely coupled computational grid, a number of grid speci...
متن کاملStrategies for Solving SAT in Grids by Randomized Search
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this paper we develop strategies for solving collections of hard instances of the propositional satisfiability problem (SAT) with a randomized SAT solver run in a Grid. We study alternative strategies by using a simulation fra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008